Methods and apparatuses of digital data processing

ABSTRACT

The invention Ubit can make data semantics understandable to both humans and machine; semantic translating tools no needed any more, such as compiler, interpreter, semantic analysis, web parser, domain name resolution; machine embodies real intelligence. 
     The three password authentication makes entity authentication nearly unbreakable. Three key encryption can easily realize one-time pad, and also can used in data storage encryption; making data in perfect secure. 
     Ubit presents an interface method between human and human, between machine and human, and between machine and machine; makes all data compatible one another; and anyone can access anything, from anywhere, and in anytime. 
     The methods make hardware and software much more precisely, efficiency and space saved. 
     All methods can be easily implemented.

TECHNICAL FIELD

Binary 1 and 0 digital data processing methods and apparatus.

BACKGROUND

Digital data representation and processing has been facing a big amountof very difficult problems; among them, three are most important andbasic: How to make data security? How to make data understandable tocomputer and human? How to make data universal, no conflict, no matterwhat, no matter where, no mater when?

Data security risk has shocked everyone, every business, and everynation over the world; cyber, big data, cloud and mobile devices, areall in risk; according to a report, U.S. cloud industry stands to lose$35 billion because security risk; an assassin might kill his victim bydisabling an implanted pacemaker or defibrillator from 30 feet away. Itwould be possible to write a “worm” for a particular brand of pacemakeror defibrillator, then spread it to other devices within range, from oneperson to another. Data virus might become human's virus.

Machine doesn't understand source program, which must be translated tomachine for execution. Machine doesn't know what data it displayed, evendoesn't know what is data, what is program; just obeyed to executingstep by step. Therefore, Computer scientists dream that: humans cancommunicate with machine in terms of abstract concepts which can beeasily understood for both humans and machine, the source program is notforced translated to machine language; and machine could performalgorithm discovery process rather than just obeyed execution.

Conflicts exist everywhere, from time to time. Different software,documents, code sets, different languages, different versions, differentstandards, different hardware, different time period, conflict oneanother. We had to solve these conflicts one by one; however, oneconflict problem seems solved, new conflict problems appear.

Why the protected data is attached so easily? Why Computer scientists'dream can't be realized? Why conflicts exist everywhere and hardlysolved? All these are because Bit.

The bit, binary 1 or 0, has been only acted as value, basic unit ofcapacity, since the first digital computer was born. Bit has never beenused as structure before, and all problem solutions only depend on Bitvalue, not structure.

If a bit is only acted as value, only represents the capacity of data,the value of data, then bit is called as Vbit.

This invention makes bit can also acted as basic structure unit, togroup, classify, organize and distinguish data, to make data structuredand distinguishable; in this case, bit is called as Ubit. Bit can bedivided into two class: Vbit and Ubit.

To make important or private data safe, unbreakable, this invention putsdata into complicated Ubit structures. Encryption combines two parts:structure encryption and value encryption.

Ubit presents various cipher algorithms, integrating hiding,substituting, and transposing technique as a whole; the data is hided inUbit structures. It's impossible to know what is Vbit, what is Ubitwithout cipher key. Algorithm is multitudinous, unpredictable and fullydependent on key; further, the key structure is complicated, invisible,in big variable length; key is divided into in-key and out-key; keyexchange is safe and unbreakable; algorithm analysis and brute forceattacks is useless.

Out-password and in-password mechanism makes password unbreakable by anycracking methods used now.

Dictionary Attack, Brute Force Attack and offline cracking are uselessbecause in-password is too long and too complicated, not only plaintext.

Key logger or screen scraper, video recording, shoulder surfing,phishing and social engineering can only steal static out-password, noway for in-password and dynamic out-password.

Ubit makes data semantic, understandable to both humans and machine; nocompiler needed to run a source program. Machine can perform algorithmdiscovery process rather than just obeyed execution, and embodies realintelligence. Computer scientists' dream has been realized.

Ubit make all data consistent one another, no matter old or new, nomatter what kinds, what code sets, what code length, no matter whatplatform, machine, networks, languages, documents and media.

Ubit makes hardware and software cheaper, much more efficiency and spacesaved.

All methods of this invention can be easily implemented.

The humans in this article can refer to any living creature, or livingthing, which can communicate by a language. The machine here refers toany apparatus or equipment implemented with binary 1 and 0 sequence.

DETAIL DESCRIPTION

1. A binary 1 and 0 digital data processing method, the processingcomprising at least one of the following steps:

1) Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Right 0 rule as the following:

Scanning a binary 1 and 0 sequence from left to right, if the first bitis 1, continue scanning until a bit 0 is met, then from the first bit 1to bit 0 is distinguished as a group; if the first bit is 0, then thebit 0 is distinguished as a group; continue scanning and distinguishinguntil the end of the sequence, if the last bit of the sequence is not 0,then the last group is an incomplete group;

The group above is characterized as:

The left bit neighbor of a group can't be 1, but the right bit neighborof a group can be 1 or 0, there is one and only one bit 0 in one group,if there are more than 1 bit in a group, then the bit 0 must be therightmost bit in the group;

Refer to FIG. 1(a).

2) Scan a binary 1 and 0 sequence from right to left, distinguishing thesequence into group step by Right 0 rule as the following:

Scanning a binary 1 and 0 sequence from right to left, if the first bitis 1, continue scanning until a bit 0 is met, then from the first 1 tothe right neighbor bit of the bit 0 is distinguished as an incompletegroup; if the first bit is 0, continue scanning until second bit 0 ismet, then from the first 0 to the right neighbor bit of the second bit 0is distinguished as a group; continue scanning and distinguishing untilthe end of the sequence,

The group above is characterized as:

The left bit neighbor of a group can't be 1, but the right bit neighborof a group can be 1 or 0, there is one and only one bit 0 in one group,if there are more than 1 bit in a group, then the bit 0 must be therightmost bit in the group;

Refer to FIG. 1(a).

3) Scan a bit 1 and 0 sequence from right to left, distinguishing thesequence into group step by Left 0 rule as the following:

Scanning a bit 1 and 0 sequence from right to left, if the first bit is1, continue scanning until a bit 0 is met, then from the first 1 to thebit 0 is distinguished as a group; if the first bit is 0, the bit 0 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence, if the last bit of the sequence is not 0, then thelast group is an incomplete group;

The group above is characterized as:

The right bit neighbor of a group can't be 1, but the left bit neighborof a group can be 1 or 0, there is one and only one bit 0 in one group,if there are more than 1 bit in a group, then the bit 0 must be theleftmost bit in the group;

Refer to FIG. 2(a).

4) Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Left 0 rule as the following:

Scanning a binary 1 and 0 sequence from left to right, if the first bitis 1, continue scanning until a bit 0 is met, then from the first 1 tothe left neighbor bit of the bit 0 is distinguished as an incompletegroup; if the first bit is 0, continue scanning until next bit 0 is met,then from the first 0 to the left neighbor of the next bit 0 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence,

The group above is characterized as:

The right bit neighbor of a group can't be 1, but the left bit neighborof a group can be 1 or 0, there is one and only one bit 0 in one group,if there are more than 1 bit in a group, then the bit 0 must be theleftmost bit in the group;

Refer to FIG. 2(a).

5) Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Right 1 rule as the following:

Scanning a binary 1 and 0 sequence from left to right, if the first bitis 0, continue scanning until a bit 1 is met, then from the first bit 0to bit 1 is distinguished as a group; if the first bit is 1, then thebit 1 is distinguished as a group; continue scanning and distinguishinguntil the end of the sequence, if the last bit of the sequence is not 1,then the last group is an incomplete group;

The group above is characterized as:

The left bit neighbor of a group can't be 0, but the right bit neighborof a group can be 1 or 0, there is one and only one bit 1 in one group,if there are more than 1 bit in a group, then the bit 1 must be therightmost bit in the group;

Refer to FIG. 3(a).

6) Scan a binary 1 and 0 sequence from right to left, distinguishing thesequence into group step by Right 1 rule as the following:

Scanning a binary 1 and 0 sequence from right to left, if the first bitis 0, continue scanning until a bit 1 is met, then from the first 0 tothe right neighbor bit of the bit 1 is distinguished as an incompletegroup; if the first bit is 1, continue scanning until next bit 1 is met,then from the first 1 to the right neighbor bit of the next bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence,

The group above is characterized as:

The left bit neighbor of a group can't be 0, but the right bit neighborof a group can be 1 or 0, there is one and only one bit 1 in one group,if there are more than 1 bit in a group, then the bit 1 must be therightmost bit in the group;

Refer to FIG. 3(a).

7) Scan a binary 1 and 0 sequence from right to left, distinguishing thesequence into group step by Left 1 rule as the following:

Scanning a binary 1 and 0 sequence from right to left, if the first bitis 0, continue scanning until a bit 1 is met, then from the first 0 tothe bit 1 is distinguished as a group; if the first bit is 1, the bit 1is distinguished as a group; continue scanning and distinguishing untilthe end of the sequence, if the last bit is not 1, then the last groupis an incomplete group;

The group above is characterized as:

The right bit neighbor of a group can't be 0, but the left bit neighborof a group can be 1 or 0, there is one and only one bit 1 in one group,if there are more than 1 bit in a group, then the bit 1 must be theleftmost bit in the group;

Refer to FIG. 4(a).

8) Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Left 1 rule as the following:

Scanning a binary 1 and 0 sequence from left to right, if the first bitis 0, continue scanning until a bit 1 is met, then from the first 0 tothe left neighbor bit of the bit 1 is distinguished as an incompletegroup; if the first bit is 1, continue scanning until a bit 1 is met,then from the first 1 to the left neighbor of the last bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence,

The group above is characterized as:

The right bit neighbor of a group can't be 0, but the left bit neighborof a group can be 1 or 0, there is one and only one bit 1 in one group,if there are more than 1 bit in a group, then the bit 1 must be theleftmost bit in the group;

Refer to FIG. 4(a).

9) Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into groups by Right 0 and Right 1 mixed rule as the following:

Scanning a binary 1 and 0 sequence from left to right, if the first bitis 1, continue scanning until a bit 0 is met, then from the first bit 1to bit 0 is distinguished as a group; if the first bit is 0, continuescanning until a bit 1 is met, then from the first bit 0 to bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence;

The group above is characterized as:

There is one and only one bit 0 or one bit 1 in one group, and the bitnumber of one group must be greater than 1;

Refer to FIG. 5(a).

10) Scan a bit 1 and 0 sequence from right to left, distinguishing thesequence into groups by Left 0 and left 1 mixed rule as the following:

Scanning a bit 1 and 0 sequence from right to left, if the first bit is1, continue scanning until a bit 0 is met, then from the first 1 to thebit 0 is distinguished as a group; if the first bit is 0, continuescanning until a bit 1 is met, then from the first 0 to the bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence;

The group above is characterized as:

There is one and only one bit 0 or one bit 1 in one group, and the bitnumber of one group must be greater than 1.

Refer to FIG. 6(a).

A complete group distinguished by the steps above is called as anUframe; each bit in an Uframe, is acted as basic structure unit, calledas Ubit; to make data structured and understandable, and to make datamore safe. Uframe is a basic structured data component. Uframe typeincludes Right 0 Uframe, related to step 1) and 2); Left 0 Uframe,related to step 3) and 4); Left 1 Uframe, related to step 7) and 8);Right 0 and Right 1 mixed Uframe, related to step 9); Left 0 and left 1mixed Uframe, related to step 10).

As a structure unit, Ubit is not act as value.

If a bit acts as value, not act as structure unit, the bit is called asVbit.

If a bit acts as mark, but not act as structure unit, not in an Uframe;the bit is also Vbit.

A bit can act as Ubit, or Vbit.

Ubit can act as Vbit, and Vbit can also acted as Ubit.

2. The method as defined above as used in distinguishing a binary 1 and0 sequence into groups; further comprising at least one of the followingcharacteristics:

1) Distinguish a binary 1 and 0 sequence into groups based on a definedUframe sequence outside the sequence, and the relation of the binary 1and 0 sequence and the Uframe sequence also defined;

In FIG. 1(b), FIG. 2(b), FIG. 3(b), FIG. 4(b), FIG. 5(b), and FIG. 6(b),the 12 byte sequence is grouped into groups by Uframe sequence outsidethe sequence

Each Ubit in the Uframe sequence relates to 1 byte in the byte sequence.

Another example, Chinese character sequence is distinguished as words byUframes outside the character sequence in FIG. 7.

Here, each Ubit relates to 1 character in the character sequence.

2) Distinguish a binary 1 and 0 segment sequence into groups based on adefined Uframe sequence inside the binary 1 and 0 sequence;

A segment contains bits, and at least 2 bits. For example, the 12 bytesequence is grouped into groups by Uframe in FIG. 1(c), FIG. 2(c), FIG.3(c), FIG. 4(c), FIG. 5(c), and FIG. 6(c); the Uframe are inside thebyte sequence, each group is called as Ubit group. Here, each byte is asegment.

Select one bit in each segment in a segment sequence, set each selectedbit according to an Uframe sequence, then the segment sequence isgrouped into groups, each group is called as Ubit group.

Ubit group can be also described as following: an Uframe sequence insidea 1 and 0 segment sequence distinguishes the 1 and 0 segment sequenceinto groups, each group is called as Ubit group.

Uframe can be constructed based on the methods described in method 1;the length of Uframe can be defined as necessary.

Ubit group is also called as Ucode, or Ucode. However, the concept ofgroup is more generalized than code; called as Ucode, or Ucode is justfor convenience, the meaning is equal to Ubit group.

An Ucode can be very small, but at least 2 bits, it can extend to verylong, no limited.

An Ucode contains one segment or multiple segments, each segmentconsists of Ubit and Vbit, Ubit is acted as basic structure unit, usedto group, to organize, and to structure data; Vbit is acted as value, tocode object.

As bit acts as value, the bit is called as Vbit; sometimes, bit can beacted as mark, but not in an Uframe, this kind of bit is still Vbit, notUbit.

The length of segment in an Ucode can be equal or not equal.

In a 1 and 0 sequence, bit group are not distinguished by Uframe, iscalled as Vbit group, or Vbit code, or Vcode.

All character codes used now are Vcodes.

A group of bits is called as bit group, such as: Uframe, Ubit group,Vbit group.

Nearly all bits in a Vbit group are acted as value, they are Vbit; somebit in a Vbit group may be acted as mark, but they are not in Uframe,therefore, this kind of bit is still Vbit, not Ubit. Therefore, Vbitgroup only consists of Vbit.

In FIG. 1(c), FIG. 2(c), FIG. 3(c) FIG. 4(c), FIG. 5(c), and FIG. 6(c),the Ubit is at the leftmost bit of each byte; however, it can be at anyposition of a segment.

In a 1 and 0 sequence, Ucodes are distinguished by one grouping rule asdescribed in 1, but Vbit groups are not. For example, if ASCII codes ina 1 and 0 sequence are distinguished by one grouping rule as describedin 1, then they are Ucodes; if ASCII codes are distinguished by the codelength, they are not Ucodes. As another example, in a code sequence,ASCII codes mixed with GB 2312 codes, the codes are distinguished by theleftmost bit of each byte, 0 or 1; they are not Ucodes either; in thiscase if one grouping rule is used, then error would happened, oneChinese character code and an ASCII code might be distinguished as agroup. Ucode has a lot of advantages over Vcode.

For example, In FIG. 1(c), there are 5 Ucodes, the length of them is 2,3, 1, 1, 5 byte respectively; that is any different length of Ucodes canbe mixed in a sequence, however, any different length of Vcodes can't bemixed in a sequence.

Variable-length Ucodes, different kinds of Ucodes can be mixed in onesingular sequence; one object can be coded by one Ucode. For example,each object in FIG. 8(b) is corresponding to 1 Ucode in (a)respectively, the underlined objects are audio, video, image, 2characterChinese word; 1 character Chinese word, 3 character Chinese word, and 1English letter, respectively. Each audio, video or image object is 3byte Ucode; and the type of object can be distinguished by the firstbyte of the Ucode, which is called as class byte. For example, the firstunderlined Ucode {F2 A0 2D} is an audio object, the second underlinedUcode {F3 A0 6A} is a video object; the third underlined Ucode {F1 A27C} is an image object; F1, F2, F3, is related to audio, image, videoobject respectively. That's to say: object's attribution is embedded inUcode.

3) Distinguish a binary 1 and 0 sequence into groups by Ucodes outsidethe sequence;

The following expression is an Ucode sequence:

yCoordinate=intercept+Slope*xCoordinate

The expression includes 4 variables and 3 operators; they arerepresented in 7 Ucodes.

The value of the variables is stored in another sequence, a consecutivestorage apace; each variable's address in the storage space is embeddedin it's Ucode; therefore, the storage space is distinguished into groupsby the addressed in Ucodes, i.e. by Ucodes.

Another example is illustrated in FIG. 8, (a) is an Ucode sequence, (b)is a character sequence, which is grouped by the Ucode sequence in (a);the Ucode and the character group is related one to one.

4) Distinguish a binary 1 and 0 sequence into groups by Ucodes insidethe sequence;

As illustrated in FIG. 9, a binary 1 and 0 sequence is divided into Nsegments (Seg) by N Ucodes (Uc), each segment's attribution is embeddedin it's related Ucode, such as data type, the length of each segment.

5) Change Uframe type by bitwise operation;

For example:

Bitwise NOT operation on Right 0 Uframe changes to Right 1 Uframe.

Left circular operation on Right 0 Uframe changes to Left 0 Uframe, butthe Uframe is reorganized.

6) Information embedded in or associated with Ucode.

Here, information refers to any kind of data, such as objectattribution, object semanteme, relation among objects, rule, knowledge,language, and so on.

In the following parts of this description, the meaning of attributionis not limited, it also refers to information.

Embedded means putting information inside an Ucode, the value part ofthe Ucode. Because the length of Ucode is no limited, it can hold enoughinformation.

Usually one Ucode relates to one Uframe (except nested Ucode);therefore, embedded in Ucode can also say embedded in Uframe.

How to make data understandable to machine and humans? This is afundamental problem.

For example:

If “123” is described in notation form, only understandable to humans;to make it understandable to machine, it must be translated to machinelanguage.

If “123” is described in machine language, only understandable tomachine; to make it understandable to humans, it must be translated tohumans' language.

Not just “123”, nearly everything is in similar scenario.

However, if “123” represented in Ucode, and embedded in or associate tomachine language and human's language, then data can be understandableby humans and machine.

Humans write source program in notation form, which must be translatedto machine. However, Ucode can make it different.

Assume there are three kinds of primitives in a programming language:keyword, operator, and identifier. Assume each keyword, operator, oridentifier is represented by one 3-byte Ucode, and with attributionembedded inside as illustrated in FIG. 10. The attribution embedded inUcodes is understandable to machine.

FIG. 11 Illustrates how Ucode related to humans' language, the 1^(st)column is Ucodes of operator and keywords; the 2^(nd) column is thedisplaying symbols related to each Ucode. Identifier can be done by thesame way. This makes the program understandable to humans. FIG. 8illustrates another example, (a) Attribution embedded in Ucodeunderstandable to machine, and (b) Symbols related to Ucodeunderstandable to humans.

It's possible to make machine execute source program, Ucode sequence,directly, or to make machine execute Ucode sequence by extracting themachine language from the Ucodes.

Next, illustrate how to extract the machine language from the followingexpression represent in Ucode.

yCoordinate=intercept+Slope*xCoordinate

Each primitive in the expression is related to one Ucode; as programinputting, type and address of a variable are filled in related Ucode.

There are three operators, =, *, +; the value of their related Ucodes iscoded according to the privilege of the operators. So the operatingrules have been embedded in Ucodes.

Humans can understand the expression by symbols; machine can understandthe expression by the attribution embedded in Ucodes.

Because the information, collected by a compiler in lexical, syntax andsemantic analysis; has been embedded in Ucodes; the machine language canbe extracted from the source program directly, complier no needed.

The machine knows the data type, the addresses of the variables; theprivilege of operators, the operating rules; therefore, the machineknows what operation sequence, what instructions should use, where toaccess; i.e. how to execute the expression. Next illustrate how extractthe machine language from the expression.

Compare the Ucodes of “=, *, +” the highest privilege is: *; socalculate * first; buffer=Slope*xCoordinate;

Then

yCoordinate=intercept+buffer.

These two expressions above is called as three address code in compiler,and easy to be mapped to assembly language; the later is mapped as thefollowing:

mov ax, intercept;

add ax, buffer;

mov yCoordinate, ax;

For simplicity, here buffer, intercept, and yCoordinate only refer tomemory address extracted from Ucodes. Suppose the machine's assemblylanguage is represented in Ucodes also; the machine instruction codeshave been embedded in Ucodes. Extracting machine instruction codes,addresses from the Ucodes, then machine code of the expression isextracted.

This makes software cross platforms, cross machines, cross networks,cross languages.

In above example, the humans' language is related to Ucodes; Ucode canalso code humans' language, for example, 3 byte Ucode can code 2 bytecharacters, the first byte for what kind of language, or what kind ofcode set, such as GB2312, JISX 0208 and KSC 5601.

Ucode can code, embed, or associates various languages; humans'language: such as natural language, algorithms, markup language,programming language, mathematical language; machine languages; animal'slanguages.

3. The method as defined in 2 wherein further comprising at least one ofthe following characteristics:

1) Represent and process language understandable to humans and machineby attribution embedded in or relate to Ucode;

2) Machine execute a language by extracting the attributions from theUcode sequence;

3) Machine execute a language by executing the Ucode sequence directly;

4) Represent and process programming language by primitives' attributionembedded in or related to Ucodes;

5) Machine execute source program in Ucode sequence directly;

6) Machine executing Ucode sequence directly;

CPU can understand Ucodes by microprogramming, this can make parallelismeasier.

Operating system understands Ucodes that can make operating system levelparallelism easier.

Animal' language represented by Ucodes, should be animal understandableand machine understandable;

7) Machine executing Ucode sequence by extracting the attributions fromthe Ucode sequence;

8) Store language word segmentation information in Uframe sequence;

Refer to FIG. 7.

9) Make language syntax, semanteme or phone information embedded in orrelate to Ucode;

Refer to FIG. 8.

10) Comprehend a language by extracting attribution embedded in orrelate to Ucode;

Refer to FIGS. 8, 10 and 11.

11) Represent and process data or data structure by data or datastructure attribution embedded in or relate to Ucode;

Hear the data can be any type, such as integer, float, pointer andarray.

FIG. 10 illustrate Ucode format for data type.

FIG. 12 is Illustration of array storage at the memory addresses.

Assume the array is “A”, from the Ucode of “A”, as shown in FIG. 8, findthe memory address of “A”; from the first Ucode in the memory address of“A”, which is filled in the Ucode as program inputting; extract thedimension: 2, and the data type: 4 byte integer; from the second Ucode,extract the row number: 2; from the third Ucode, extract the columnnumber: 3. Data structure can be any type, linear or nonlinearstructure, such as list, linked list, tree structure.

For example, represent each node of a tree or a linked list by one ormultiple Ucode, and embed the node attribution inside.

FIG. 13. Illustrating tree structure representing

(a) Ucode for machine

(b) Ucode related character string for humans.

Assume the tree structure of FIG. 13 is a file system, the Ucode in eachnode embedded in or related to attributions of the file, including theaddress in storage space, by which the machine can access the file.

The String in FIG. 13(b) is related to the Ucode in (a), humans canunderstand the file structure by the string. Here the string is in filedirectory form, other form can be used, for example, FIG. 8(b) displayedin object name and type.

12) Machine executing mathematical operation by the operations ofUcodes;

Overflow refers to that a calculation or operation yields a result thatis too large for the computer register to handle.

If number is represented in Ucode, because the length of Ucode is notlimited, the value of the number is not limited; because the numberconsists of segments in an Ucode, the calculation can be divided intosteps, each step, just fetch some segments into registers.

Overflow problem can be easily solved by Ucode, so the truncation errorproblem.

Data operation can include two parts: value operation and structureoperation. Data operation may change the type of data. Mathematics withdata structure is called as structure mathematics; structure mathematicscan improve value mathematics, which only deals value operations.

13) Represent and process object by one or multiple Ucodes with object'sattribution embedded in or relate to Ucode;

14) Represent and process object structure, or object address or objectID by object's structure attribution, or object's address, or object'sID embedded in or related to Ucode;

Address can be global or local; global address, such as URL; localaddress, such as file directory, address in a file, address in memory.

For example, IP address can be represented in variable length Ucode;FIG. 14 Illustrates IP address represented in Ucode, (a) IPv 4 in 5 byteUcode form; (b) IP in 7 byte Ucode form; the shaded 3 bits can be usedto represent protocol. 5 byte Ucode form can represented all IPv 4address; extending to 7 bytes or more as needed.

Ucode form can associate to notation for humans.

URL of a file consists of 2 Ucodes, IP address and File address.

An Ucode can also represent an object address in a file; then globallyaccess the object needs 3 Ucodes.

The file directory of each audio, video or image object in FIG. 8(a) isrelated to one Ucode, and the file attribution has been embedded in.

15) Represent and process executable instruction by instruction'sattribution embedded in or relate to Ucode;

Executable operations, such as CPU instruction or system call, or calledfunction;

16) In a binary 1 and 0 sequence, object attribution is tagged by Ucode,or embedded in Ucode, or related by Ucode;

Tags in the existed documents or medias are characters, or symbols.

However, they can be Ucodes. For example, each tag in web can be oneUcode.

FIG. 9 shows an object sequence tagged by Ucodes with the objectattributions embedded in.

Assume Seg2 is a character segment coded in UCS-2, and Seg3 is acharacter segment coded in UCS-4, Seg4 is machine executable codesegment; Uc2 embedded in UCS-2 attribution and the segment length, Uc3embedded in UCS-4 attribution and the segment length, Uc4 embedded inmachine executing code attribution and the segment length. The threeobjects are different, and in different encoding, but they can bedistinguished by Ucodes. The object sequence can hold any kind ofobjects, consistent one another without conflict.

Data consistent include space consistent and time consistent. Spaceconsistent refers to different region, different areas, differentplatform, different code sets, and so on; and time consistent refers toany time, old or new.

17) Make different objects or different encoding to be consistent oneanother in one object sequence by Ucode tagging object's or encoding'sattribution;

18) Represent and process database by element or element's attributionsembedded in or related to Ucode;

19) Web page's element or element attribution tagged by Ucodes withelement's attribution embedded in or relate to Ucodes;

20) Represent and process document by element or element's attributiontagged by Ucode, or embedded in or relate to Ucode;

21) Various object mixed inputting, processing and interacting amonghumans and humans, interacting among humans and machine, interactingamong machine and machine by object attributions embedded in or relatedto Ucode; and language embedded in or related to Ucode; Various kinds ofobjects, or variable length Ucodes, can be mixed inputted and processedas illustrated in FIG. 15-19. (The operation for Chinese word is byChinese Pinyin)

It's possible that inputting and processing is understandable by humansor machine; from any machine, any person, anywhere, any platform, anynetworks, and in any language. Inputting method is unlimited, such as:by hand, by speech, by eye, by feeling, and by gesture.

Software can be edited as document, and easily be protected, programmingand software debugging is easier, the difference between algorithms andprograms, the difference among different programming languages, thedifference among platforms, the difference among different naturallanguages, the difference among different languages in various areas,become less.

22) Represent and process image or audio or video by attributionsembedded in or related to Ucodes;

23) Divide image or audio or video into segments by segment'sattributions embedded in or related to Ucodes;

24) In pattern recognition, representing and processing object featureby attributions embedded in or related to Ucodes;

25) In artificial intelligence processing, representing and processingby Ucodes;

For example: agent, percept sequence, action sequence, program, neuron,and so on.

26) In data compression, representing and processing data byattributions embedded in or related to Ucode;

For example, represent and process data redundancy by Ucodes.

27) Represent and process cartoon by element's attributions embedded inor related to Ucode;

28) Represent and process in computer control, or aided design ormanufacture by attributions embedded in or related to Ucode;

29) Communication or network by transmitting Ucode sequence or Uframesequence;

30) Communication and interactive among humans, communication andinteractive among machines, communication and interactive among humansand machines by humans' language, or by machine's language, or byhumans' language and machine's language embedded in, or related to Ubitgroups;

The communication and interactive can be local or remote, can be used inbionic simulation, such as representing and processing neural network,machine intelligence, and so on.

31) Represent and process an object sequence by one or multiple binary 1and 0 sequence; at least in one sequence Ucode or Uframe is used;

32) Represent and process static or dynamic structured object byattributions embedded in or related to Ucode;

33) Representing and processing object or object part by attributionsembedded in or related to Ucode;

34) Machine execute operation by extracting attributions embedded in orrelated to Ucode;

35) Machine execute hardware operation among hardware by extractingattributions embedded in or related to Ucode;

Such as hardware ID, connection or disconnection, change parts, changestructure.

36) Humans or machine comprehend message by extracting attributionsembedded in or related to Ucode;

37) Make Robot semanticized and understandable to humans and machine oramong robots by related attributions embedded in or related to Ucode;

38) Representing and processing cloud calculation or big data byattributions embedded in or related to Ucode;

39) Make multiple kernels or CPU or operating system parallelism byUcode;

40) Representing and processing operating system file system byattributions embedded in or related to Ucode;

41) Make a binary 1 and 0 sequence or a random number as an Ubit Framekey or an Ucode key;

A key of an Ucode sequence is called as Ucode key.

A key of an Uframe sequence is called as Uframe key.

Each bit in an Uframe key acts as an Ubit; however, as used inoperation, each bit in Uframe key also can act as a Vbit.

An Ucode key can be made depending on a binary 1 and 0 sequence or arandom number, such as: the segment length of Ucode, the grouping rule,the Ubit position located in a segment, and so on.

42) Transpose Uframe related bits in one binary 1 and 0 sequenceaccording to Uframe key; FIG. 20 is an example for transposition. Thebits related to one Ubit of one Uframe is called bit segment. Forexample, in the second row of FIG. 20, 1 to 12 refers to bit segment.One bit segment contains one bit or multi-bits. Uframe and related bitsegment is rearranged.

The transposition can be used in stream cipher or block cipher.

43) bits, characters, words, phrases, or other data substituted byUcodes, or embedded in Ucodes, or associated with Ucodes;

44) Operating on a binary 1 and 0 sequence with Uframe key;

In operation, each Ubit in an Uframe sequence can act as Vbit, differentframe can do same or different operation.

45) Hide Uframe key into or extract Uframe key from a binary 1 and 0sequence; or hide a binary 1 and 0 sequence into or extract a binary 1and 0 sequence from Uframe key mixed sequence;

This can be used in cipher or steganography; the inserted data can beextracted according to the Uframe key.

46) Code or embed data into, or decode or extract data from a binary 1and 0 sequence according to an Uframe key;

Code data into bit segments; the coded data is hardly decoded withoutthe Uframe key.

Transposing, coding, and embedding can be combined together.

47) Shifting Ucode key or Ubit frame key by Ucode or Ubit frame;

This is illustrated in FIG. 21. The shift length can be different eachtime.

48) Operating an Ucode key with a binary 1 and 0 sequence;

XOR operation is illustrated in FIG. 22. In operation, the Ubit in Ucodecan act as Ubit or Vbit.

49) Operating times between Ucode key and binary 1 and 0 sequencedepends on Ucode key;

50) Extracting Uframe sequence from binary 1 and 0 sequence used in dataintegrity or authentication;

As extracting, select segment and the length of a segment, select 1 bitin each segment as Ubit, extract Ubit from each segment, then form anUframe sequence.

Extracting one or multiple Uframe sequence can be used in authenticationor data integrity for one data or multiple data;

The counted Uframe number can also used in data integrityauthentication.

51) Insert message embedded in Ucode chain into a binary 1 and 0sequence;

For example, insert message into image for steganography.

52) Detect malicious message or expected message by matching Uframepattern or Ucode pattern from binary 1 and 0 sequence;

Uframe pattern is a known Uframe sequence, and Ucode pattern is a knownUframe sequence.

53) Cipher data by changing or blocking object structure or objectattributions or object relations embedded in or related to Ucodes;

54) Execute hardware operation by changing or blocking its structure orobject attributions or object relations embedded in or related toUcodes;

55) Apply Uframe or Ucode in digital signature.

4. The method as defined in 1, or 2, or 3, wherein the method orcharacteristic further comprising at least one of the followingcharacteristics:

1) Applied in sequence plane, sequence space, dynamic sequence plane, ordynamic sequence space;

Sequence plane refers to a serial sequences arranged in a plane;sequence space refers to a serial sequence planes arranged in a space,dynamic refers to changes as time changes.

2) Applied in software, or hardware, or apparatus.

The methods can be applied in each binary 1 and 0 digital dataprocessing area, no matter what kind form 1 and 0 is represented, suchas electronic, quantum, biological form.

5. A binary 1 and 0 digital data processing method, an object, there aremultiple first level attributions, and at least one first levelattribution possesses multiple second level attributions, but the objectonly relates to one bit group; the characteristic is the original bitgroup related to one second level attribution, add one or more new bitgroup related to other second level attribution, the processing furthercomprising at least one of the following steps:

1) Get the object's first level attribution by the correspondingrelation between new and original bit group;

2) Get the object's first level attribution by the relation between anew bit group and object's first level attribution.

6. A binary 1 and 0 digital data processing method, the characteristicis the object is Chinese polyphone character, the original bit group ofpolyphone character is GB 2312 coded, and the new bit group part isconnected with one end of the GB 2312 character part, each new bit groupis 2 byte, and the leftmost bit of each byte is 1, wherein furthercomprising at least one step of the following steps:

1) Get the new bit group's grapheme by the corresponding relationbetween new bit groups and the original bit groups of the polyphonecharacters;

2) Get Pinyin Tone Code of a character according to the relation betweenPinyin Tone Codes and original codes or between Pinyin Tone Codes andnew bit groups;

3) Get character's Pinyin without tone representation according to therelation between its Pinyin Tone Code and Pinyin;

4) Get character's Pinyin with tone getting help from Pinyin Tone Code;

5) Get character's or word's speech according to the relation betweenPinyin Tone Code and its pronunciation lib;

6) Input characters getting help from the relation between Pinyin ToneCode and Chinese character;

7) Compare two Chinese character string by comparing its related PinyinTone Code string;

8) Sort Chinese characters by comparing its related Pinyin Tone Codestring;

9) Search Chinese character string getting help from the relationbetween Pinyin Tone Code and Chinese character;

10) Mixed object inputting and processing getting help from the relationbetween Pinyin Tone Code and Chinese character.

Next discuss new data security methods. Data security includes entityauthentication, confidentiality, and integrity. This invention makestotally new methods for these three fields. The first two depends arelation between two sequences.

FIG. 27 illustrates a relation between two sequences: out-bit groupsequence and in-bit group sequence.

Out-bit group and in bit group in FIG. 27 is also shortly called asout-group and in-group respectively as in 28.

In-group string consists of one or multiple in-groups, a sequence is asequence, but usually shorter than a sequence; here called as sequenceis for distinguishing from the sequence in the relations of FIGS. 27 and28. It's the same reason for out-group sequence.

The relation can be: implicit or explicit. For example, if out-group isASCII code and the out-group sequence is arranged in the ASCII codeorder, then, the in-group can be searched by ASCII code, in this case,the out-group sequence can be omitted, this kind relation is implicit.However, explicit relation is safer.

Multiple relations can be in different form, such as: multiple pairrelation between out-group sequence and in-group sequence, or oneout-group sequence related to multiple in-group sequences as shown inFIG. 28.

There are different methods to realize dynamic in-group sequence ordynamic out-group sequence; for example, dynamically select one relationfrom multiple relations, or dynamically change one relation, ordynamically change the arrange order of a sequence.

To keep the relation safe, cipher the relation or disconnect therelation as not used; or store the relation separately. Connection canbe physical direct connection, or wireless, or by line.

Password or key plays very important role in data security, theirweakness is similar in some cases.

First discuss entity authentication based on password.

Ideally password should be easy to remember and hard to guess.Unfortunately these two goals are conflict with each other. Howeverthree password mechanism can solve the problem successful.

A binary 1 and 0 digital sequence, called as U-password, a binary 1 and0 digital sequence, called as out-password, a binary 1 and 0 digitalsequence, called as in-password. Here, U-password relates to therelation, or the relation can be generated by U-password.

Similarly the relation can also be generated by U-nonce or by U-key asdiscussed later.

In-password is hard to guess, but the out-password is easy to remember.

For example, a computer system or remote server stores user'sin-password.

User inputs the out-password, which is transformed into user'sin-password by an application program, such as an input method, based onan U-password. Then comparing transformed ciphered in-password with thestored ciphered in-password can do user's authentication.

Dynamic out-password is illustrated in FIG. 28.

Assume out-password consists of digit 0-9.

Assume: I₁=3er78

, I₂=90, I₃=45uip

, I₄=w

As input out-password: 1234, the related in-password is: 3er78

90 45uip

w

.

Here, out-password is 4 digits, but in-password is 18 characters.

To realize dynamic out-password as following:

(a) Select the relation out-group1 as shown in FIG. 28, the out-passwordis: 1234; related in-password is: I₁, I₂, I₃, I₄

(b) Select the relation out-group2, new out-password is: 5678; relatedin-password still is: I₁, I₂, I₃, I₄

Dynamic out-password is realized by selecting one from multiple in-groupsequence dynamically. Here, out-password is dynamically changed, butin-password kept no change.

In computer, user or system realizes dynamic out-password by changingthe relation as above. For ATM or POS machine, implemented with an inputmethod to transform out-password to in-password, bank can send onein-password sequence selected from multiple in-password sequences toATM, or POS machine dynamically, to realize dynamic out-password; eachtransaction with one dynamic out-password.

Dictionary Attack, Brute Force Attack and offline cracking are uselessbecause in-password is too long and too complicated, may not only plaintext.

Key logger or screen scraper, video recording, shoulder surfing,phishing and social engineering can only steal static out-password, noway for in-password or dynamic out-password.

The basic idea used in user authentication can be used in dataencryption.

The method can be represented by two ways.

First way is described as following:

7. A binary 1 and 0 digital data processing method, the characteristicis based on relation between out-group sequence and in-group sequence;data security processing further comprising at least one of thefollowing steps:

1) Two parties; entity authentication processing comprising thefollowing steps:

(a) Party B transform an out-group string to related in-group string orciphered in-group string based on relation between out-group sequenceand in-group sequence and send to party A;

(b) Party A compare the in-group string or ciphered in-group stringreceived from party B with the pre-stored in-group string or pre-storedciphered in-group string for party B;

(c) Authenticated or failed according to the compared result;

2) Two parties share relation between out-group sequence and in-groupsequence; entity authentication processing comprising the followingsteps:

(a) Party A sends an out-group string to party B,

(b) Party B transform the out-group string to related in-group string orciphered in-group string; and send to party A;

(c) Party A compare the in-group string or ciphered in-group stringrelated to the out-group string sent to party B with the in-group stringor ciphered in-group string sent from party B;

(d) Authenticated or failed according to the compared result;

3) Two parties share relation between out-group sequence and in-groupsequence; data encryption processing comprising the following steps:

(a) Party A sends a message encrypted by an in-group string key, andalso sends the related out-group string to Party B,

(b) Party B decrypts the message with the in-group string key, whichrelated to the out-group string received.

The above encryption method can be used in data storage encryption.

The second way is described as the following:

Authentication based on password, called as three passwordauthentication mechanism: a binary 1 and 0 digital sequence, called asU-password, a binary 1 and 0 digital sequence, called as out-password, abinary 1 and 0 digital sequence, called as in-password.

Authentication used in challenge and response, called as three nonceauthentication mechanism: a binary 1 and 0 digital sequence, called asU-nonce, a binary 1 and 0 digital sequence, called as out-nonce, abinary 1 and 0 digital sequence, called as in-nonce; two parties sharean U-nonce.

Symmetric encryption only uses one key in encryption and decryption.Three key encryption mechanism: a binary 1 and 0 digital sequence,called as U-key, a binary 1 and 0 digital sequence, called as out-key, abinary 1 and 0 digital sequence, called as in-key.

The ciphered in-password, or in-nonce, or ciphered in-key usually referto one way encryption: such as hash function.

U-password, U-nonce, U-key relates to the relation between out-groupsequence and in-group sequence in the first way description. U-password,U-nonce, U-key can also be used to generate the relation betweenout-group sequence and in-group sequence.

7. A binary 1 and 0 digital data processing method, belong toauthentication area, characterized that entity authentication comprisingthree password, Party A is an verifier, Party B is a claimant, entityauthentication further comprising the following steps:

(a) Party B generates an in-password or ciphered in-password based onU-password and out-password;

(b) Party B sends the in-password or ciphered in-password to party A;

(c) Party A compare the in-password or ciphered in-password receivedfrom party B with the pre-stored in-password or pre-stored cipheredin-password for party B;

(d) Authenticated or failed according to the compared result.

8. A binary 1 and 0 digital data processing method, belong toauthentication area, the authentication based on challenge and response,entity authentication characterized that authentication comprising threenonces, and two parties share an U-nonce, Party A is an verifier, PartyB is a claimant, entity authentication further comprising the followingsteps:

(a) Party A sends an out-nonce to party B,

(b) Party B generates an in-nonce or ciphered in-nonce based on theshared U-nonce and the out-nonce sent from Party A; and sends thein-nonce or ciphered in-nonce to party A;

(c) Party A compare the in-nonce or ciphered in-nonce sent from party Bwith the in-nonce or ciphered in-nonce generated based on the sharedU-nonce and the out-nonce by itself;

(d) Authenticated or failed according to the compared result;

9. A binary 1 and 0 digital data processing method, belong to encryptionarea, characterized that encryption and decryption comprising threekeys; and two parties share an U-key; data encryption and decryptionfurther comprising the following steps:

1) Party A generates an in-key or ciphered in-key based on the sharedU-key and an out-key;

2) Party A encrypts a message by the generated in-key or cipheredin-key;

3) Party A sends the encrypted message and the related out-key to PartyB;

4) Party B generates an in-key or ciphered in-key based on the sharedU-key and the out-key sent from Party A;

5) Party B decrypts the message with the in-key or ciphered in-key.

10. A binary 1 and 0 digital data processing method, characterized thatdata encryption and decryption comprising three keys; storage dataencryption and decryption further comprising at least one of thefollowing steps:

1) Encrypt steps:

a) Generates an in-key or ciphered in-key based on an U-key and anout-key;

b) Encrypt a data by the in-key or ciphered in-key;

c) Store encrypted data and the related out-key;

2) Decrypt steps:

a) Generates an in-key or ciphered in-key based on the U-key and thestored out-key;

b) Decrypt the encrypted data with the in-key or ciphered in-key.

11. A binary 1 and 0 digital data processing method, two binary 1 and 0sequence, one is as an input: s, another as an output; output is used inmessage authentication or in preventing input from being forged; s-1,s-2, . . . , s-n are sub-sequence of s, n>=1; transforming input intooutput characterized taking the following steps:

1) Select at least one item pair;

2) If the number of item pair selected more than 1; then cascaded thepairs;

3) Take hash operation of each cascaded item pair;

4) Take the result of step 3 as the output.

12. The method as defined in claim 11 further comprising at least one ofthe following characteristics:

1) The item pairs selected at least one is multilevel item pair;

2) As used in transforming a pseudorandom sequence: PS to a randomsequence: RS, take the following steps:

a) Take a NULL random sequence as RS;

b) Take an input s with a random length from PS sequentially;

c) Select n multilevel item pair;

d) Take hash operation for s as in claim 11;

e) Cascade the result of step d) to RS;

f) Loop back to step b) as needed more;

g) Output RS.

The sequentially in claim 12 means taking subsequence from PS one byone, or one after one continually.

A binary 1 and 0 sequence, s; s-1, s-2, . . . , s-n are sub-sequence ofs, n>=1; Items of s refers to the flowing:

Level 0 items: s, s-1, s-2, . . . , s-n

Level 1 items: H(s), H(s-1), H(s-2), . . . , H(s-n);

Level 2 items: H(H(s)), H(H(s-1)), H(H(s-2)), . . . , H(H(s-n));

Similarly, can deduce to more level items.

Here, H means one way hash function, such as MD5, SHA-1, SHA-256.

There are two kind of Item types: one is whole type; for example: s,H(s), H(H(s)); another type is sub type; for example: s-1, H(s-1),H(H(s-2)).

An item pair consists of two items with different type.

If the items of an item pair are selected from different types, and fromdifferent levels; then the item pair is called as multilevel item pair.

For example: s and H(s-1), H(s) and s-1 are multilevel pairs of items.

The items of a multilevel item pair usually selected from 0 level and 1level as the example above.

Then the above hash in 1) of 12 is called as multilevel hash.

The hash operation of a multilevel item pair is as following:

H(H(s)+s-1), H(H(s-1)+s) . . . and so on.

In the examples above, “+” means cascade.

Usually the hash value of one multilevel tem pair is used as the messagedigest, used in message authentication; also used in preventing asequence from being forged.

The security strength is very strong, assume MD5 128 bit hash used, forbrute force attack, adversary is very hard to get an image with lengthmuch more than 128 bits, even the image gotten, he or she has no way todecide what is the two items; that is which is the whole type, which issub type; such as H(s) or (s-1); s or H(s-1), as the example above.

If take n multilevel item pairs of s as

H(H(s)+s-1)+H(H(s)+s-2)+, . . . ,+ H(H(s)+s-n);

Or, H(H(s-1)+s)+H(H(s-2)+s)+, . . . ,+ H(H(s-n)+s).

Then the length of output sequence can be less, the same, or longercomparing to the length of the input sequence s. The hash value of ahash function is fixed, but here, the hash value of the method can befixed, or with less length, or equal or longer length.

This output value is totally different if only 1 bit change in s.

The transforming a pseudorandom sequence: PS to a random sequence: RS asclaim 12; can take the following value for each loop: s.

H(H(s)+s-1)+H(H(s)+s-2)+, . . . ,+ H(H(s)+s-n);

Or, H(H(s-1)+s)+H(H(s-2)+s)+, . . . ,+ H(H(s-n)+s).

The value above is unpredictable because the property of hash function.

The period of pseudorandom number sequence is not big enough forcryptographic application.

The method above can extend the period of pseudorandom sequenceextraordinarily.

Assume the period of the pseudorandom sequence is n, the length ofsubsequence s from the pseudorandom sequence is m1; then the period ofthe output random sequence is equal to the least common multiple of m1and n; if more subsequence: s is selected from the pseudorandomsequence, the length of s is m2, . . . , then; the period of the outputrandom sequence is equal to the least common multiple of m1, m2, . . . ,and n; extended more. This is because the output value is totallydifferent if only 1 bit change in s.

Even m1, m2 . . . all are common divisor, the out sequence can't berepeated because the length of message is random, as a new periodbegins, it can't be the same length message as the first period begins.

Because the length of output sequence can be longer comparing to thelength of the input sequence s. This can also extend the period ofpseudorandom sequence.

As pseudorandom sequence used, the period of pseudorandom sequencebecome shorter and shorter, and at last reach the end of the period.However, comparing the period of pseudorandom sequence, as used more andmore, the period of output random sequence is extended more and moreusually.

The method of claim 11-12 can also be used in generating encryption key,nonce; and also for the security of U-password, U-key and U-nonce; andetc.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 Diagram of scanning a binary 1 and 0 sequence from left to right,distinguishing the sequence into group step by Right 0 rule; and diagramof scanning a binary 1 and 0 sequence from right to left, distinguishingthe sequence into group step by Right 0 rule.

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 2 Diagram of scanning a bit 1 and 0 sequence from right to left,distinguishing the sequence into group step by Left 0 rule; and diagramof scanning a binary 1 and 0 sequence from left to right, distinguishingthe sequence into group step by Left 0 rule

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 3 Diagram of scanning a binary 1 and 0 sequence from left to right,distinguishing the sequence into group step by Right 1 rule; and diagramof scanning a binary 1 and 0 sequence from right to left, distinguishingthe sequence into group step by Right 1 rule.

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 4 Diagram of scanning a binary 1 and 0 sequence from right to left,distinguishing the sequence into group step by Left 1 rule; and diagramof scanning a binary 1 and 0 sequence from left to right, distinguishingthe sequence into group step by Left 1 rule

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 5 Diagram of scanning a binary 1 and 0 sequence from left to right,distinguishing the sequence into groups by Right 0 and Right 1 mixedrule

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 6. Diagram of scanning a bit 1 and 0 sequence from right to left,distinguishing the sequence into groups by Left 0 and left 1 mixed rule

(a) The 1 and 0 sequence is distinguished into groups;

(b) The byte sequence is grouped into groups by Uframe sequence outsidethe sequence;

(c) The byte sequence is grouped into groups by Uframe sequence insidethe sequence;

The groups are white and grey alternately shaded.

FIG. 7 Diagram of distinguishing Chinese character sequence into wordsby Uframes outside the character sequence

Above: Uframe sequence outside the character sequence;

Below: Chinese character sequence is distinguished into words by theUframe sequence above.

FIG. 8 Diagram of object attribution embedded in Ucode and related toUcode

(a) An Ucode sequence, object attribution embedded in related Ucode

An Ucode file contains 1, 2, 3, 4, and 6 byte Ucodes. The underlineUcodes are 3, 3, 3, 4, 2, 6 bytes and 1 byte, respectively.

(b) An object sequence, in which object attribution embedded in relatedUcode in (a);

The object sequence is displayed in humans' language, a charactersequence, which is grouped by Ucode sequence in (a), outside (b)

The objects are represented by 1, 2, 3, 4, or 6 byte of Ucodes; eachobject in (b) is related to one Ucodes in (a) respectively, theunderlined objects are audio, video, image, 2 character word; 1character word, 3 character word and 1 letter respectively. Each Ucodeis displayed as a group of symbols. The symbol pair “

” with enclosed characters represents audio object, the symbol pair “

” with enclosed characters represents video object; and the symbol pair“

” with enclosed characters represents image object respectively.Variable-length and different kinds of objects are mixed in a codesequence, and mixed processed.

FIG. 9 Diagram of distinguishing a binary 1 and 0 sequence into segmentsby Ucodes inside the sequence

A binary 1 and 0 sequence is divided into N segments (Seg) by N Ucodes(Uc), each Ucode contains the attribution of each segment, such as datatype, the data length of each segment.

FIG. 10. Diagram of Ucode format for keyword, operator, or identifier;

7th, 15th and 23rd are Ubit; 22nd bit is flag, 0 for identifier, 1 forkeywords or operators; for variables, the 16 bits, with grey shading,are used coding the memory address of each variable; 18th-21st bits forvariable type; if 22nd flag=1, 21st acted as flag, 0 for keywords, 1 foroperators.

FIG. 11 Diagram of associating humans' language with Ucode

The 1st column is Ucodes of operator and keyword; the 2nd column is thedisplaying symbols of each Ucode.

FIG. 12. Diagram of array storage at the memory addresses

The array with 2 rows, and 3 columns; data type is 4 byte integer,stored row by row.

(a) The 1st, 2nd, 3rd byte, are three one byte Ucodes; The first Ucodeis for dimension and data type, the second Ucode is for number of rows,the third is for number of columns. 4 to 15 bytes are used to store 1strow; and 16 to 27 byes are used to store 2nd row.

(b) The first Ucode format, 3 bits {4-6} for dimension, 4 bits {0-3} fordata type.

FIG. 13. Diagram of Ucode tree and related character string tree

(a) Ucode tree for machine

(b) Character string tree for humans, which relates to the Ucode in (a)one to one; Here the string is in file directory form, other form can beused, in FIG. 8(b) displayed in object name and type.

FIG. 14 Diagram of IP address Ucode format

(a) IPv 4 in 5 byte Ucode form

(b) IP address in 7 byte Ucode form

The shaded 3 bits can be used to represent protocol.

FIG. 15. Diagram of video clip object inputting

Input video object: clips of “

” (“cat and mouse”; “maohe”: the Chinese pinyin of “cat and mouse”).Three clips have been inputted: “

1”, “

5”, “

9”.

FIG. 16. Diagram of audio object inputting

Input an audio object: “

” (“Allis”; “zhiai” pinyin of Chinese “Allis”).

FIG. 17. Diagram of object inserting

“

” (“Allis”) has been inputted; and a three character Chinese wordobject: “

” is inserted.

FIG. 18. Diagram of object searching

Searching video object “cat and mouse 10”.

FIG. 19. Diagram of clip “cat and mouse 10” searched

Clip “cat and mouse 10” has been searched, and playing.

FIG. 20 Diagram of Transposing Uframe and the related segments

(a) Before transposing: one Uframe sequence (above row), a binary 1 and0 segment sequence (below row), a number represents a segment; one Ubitrelates to one segment. The first and second Uframe are 10, 110respectively; the related segments are 1, 2 and 3, 4, 5 respectively.

(b) After transposing: The first and second Uframe are 110, 10; and therelated segments are 3, 4, 5 and 1, 2 respectively.

FIG. 21 Diagram of shifting Ucode key

(a) Before UG8 left shift

(b) After UG8 left shift

The length of different Ucode is different.

FIG. 22 Diagram of Block cipher using an Ucode key

Ucode key operates with a sequence, first XOR operate with K1, forexample the key in FIG. 21(a), then XOR operates with k2, for example,the key in FIG. 21(b).

FIG. 23 Diagram of Object attributions

There are 3 first level attributions for the object: A1, A2, A3, butonly one bit group1 relate to the object. There are three second levelattributions for the first level attribution A2: A21, A22, A23.

FIG. 24 Diagram of bit group and object attribution relation

There are 3 bit groups, bit group2 and bit group3 are newly added; eachrelated to one second level attribution.

FIG. 25 Diagram of Chinese character Pinyin Tone Code

3 bits for Tones marked with t, 9 bits for Pinyin marked with p.

FIG. 26 Diagram of GB2312 codes and new polyphone character codes

(a) GB2312 character codes and new polyphone character codes;

(b) Pinyin Tone Code for GB2312 and New codes;

Character code and Pinyin Tone Code are related one by one.

FIG. 27 Diagram of the relation between two sequences

(a) Diagram of the relation between out-group sequence and in-groupsequence;

(b) Diagram of the relation between in-group sequence and in-groupdisplaying sequence;

(c) Diagram of the relation between out-group sequence and out-groupdisplaying sequence;

O₁, O₂, O₃ . . . Om refers to out-group sequence; out-group refers toone or multiple out-group.

I₁, I₂, I₃ . . . Im refers to in-group sequence; in-group refers to oneor multiple In-group.

In-group display: D₁, D₂, D₃ . . . D_(m.) refers to In-group displayedbit group;

Out-group display: D₁, D₂, D₃ . . . D_(m:) refers to out-group displayedbit group.

FIG. 28 Diagram of dynamic out-group

Out-group: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

In-group_(1:) I₀, I₁, I₂, I₃, I₄, I₅, I₆, I₈, I₃, I₉

In-group_(2:) I₀, I₅, I₆, I₇, I₈, I₁, I₂, I₃, I₄, I₉

If out-group string and in-group string is represent out-password,in-password respectively.

Selecting in group_(1.) out-password is: 1234; related in-password is:I₁, I₂, I₃, I₄

Selecting in group_(2,) out-password is: 5678; related in-password isstill: I₁, I₂, I₃, I₄

Out-password is dynamic; but in-password is static.

THE DIFFERENCE AND SIGNIFICANT IMPROVEMENTS OF THIS INVENTION

D1-D6 refer to References [1] to [6], the reference at the end of thisdescription.

The difference from prior art and significant improvements of claim 1-4

The difference between prior art and claim 1-4

The most close related prior art references is D1, D2 and D3; but theyonly discloses that binary bit groups; the differences features are;

Claim 1 discloses how to distinguish a bit sequence into groups;

Claim 1 discloses that the bit groups distinguished in different length;

Claim 1 discloses that the length of bit groups distinguished can be anylong.

Claim 2 depends on Claim 1, Claim 3 depends on Claim 2, claim 4 dependson claim 1, or 2, or 3. They are totally new.

The significant improvements of claim 1-4

Claim 1-4 can make big significant improvements, take some examples:

Ubit makes data semantic, understandable to both humans and machine; nocompiler needed to run a source program. Machine can perform algorithmdiscovery process rather than just obeyed execution, and embodies realintelligence. Computer scientists' dream can be realized.

For prior computer technology, machine only understand machine language,but doesn't understand human language, such as algorithm, program, webpages; which must be translated to machine for execution. Therefore, themachine can only possess artificial intelligence, but without any realintelligence.

But claim 1-4 can make machine understand human language and possessreal intelligence.

Ubit can also make hardware and software cheaper, much more efficiencyand space saved.

Refer to page 1, 5, 6 of this description; and also can refer to D4.

The difference from prior art and the significant improvements of claim5

The most close related prior art is D2.

The difference between prior art and claim 5

-   -   the relation in FIG. 23;    -   first level attribution and second level attribution

For D2:

-   -   new fonts must be added to the font lib; and modification of        computer system is needed;    -   the font lib storage space increased;    -   It is not compatible with the existed system, the added bit        groups can't be displayed correctly if computer font lib not        modified.

Significant improvements of claim 5

Claim 5 makes it easier to get different level attribution of an object;

Space saved;

Time saved;

Compatible with operation systems.

The difference from prior art and significant improvements of claim 6

The 1) of claim 6 most close related prior art is D2.

The difference between prior art and 1) of claim 6

D5 doesn't disclose that get the new bit group's grapheme by thecorresponding relation between new bit groups and the original bitgroups of the polyphone characters”

D2 needs:

-   -   New fonts must be added to the font lib; and modification of        computer system is needed;    -   The font lib storage space increased;    -   It is not compatible with the existed system, the added bit        groups can't be displayed

Significant improvements of 1) of claim 6

-   -   No need new fonts must add to the font lib;    -   The font lib storage space saved;    -   It is compatible with the existed system.

The difference between prior art and 2) to 11) of claim 6

The 2) to 11) of claim 6 most close related prior art is D2, but D2doesn't disclosure Pinyin Tone Code, it uses sequenced fullpronunciation in D5.

Pinyin Tone Code has the following advantages over sequenced fullpronunciation:

-   -   Pinyin Tone Code is 1 bit less than full pronunciation in D2;    -   No “pinyin-two letter mapping table” of D2;    -   and the processing related to the table no needed;

Significant improvements of 2) to 11) of claim 6

Space saved;

Time saved.

The difference from prior art and significant improvements of claim 7

The most close related prior art is D5, the entity authentication basedon password.

The background of this description (page 1 and page 11) and D6 describesthe significant improvements of the claim.

Password is used to type in login window, transfer to server, and usedin authentication.

Computer password was invented in the early 1960s by Fernando Corbato,the professor of MIT. Corbato recently pointed out; unfortunatelycomputer password become kind of a nightmare with the World Wide Web;this is because computer password is designed only for computer, not fornetwork; Corbato said that the scientists at that time could not haveforeseen today's modern Internet.

Although various strengthening methods had to be added, week passwordchanged to strong password, graph validate code, SMS verification codeadded during login; however, attackers still can entered user's accounteasily.

The difference between prior art and claim 7

For prior art, the authentication is protected only by one password,which used to remember and enter, for transmit, stored in server, andused to verify. Therefore, only by stolen the password, or guessed thepassword, or cracked the ciphered password, an adversary can personatethe authentication.

But for claim 7, the authentication is protected by three password,out-password, in-password and U-password.

An adversary can intercept in-password; however, from interceptedin-password, or stolen in-password can't deduce out-password, neitherU-password. Therefore, the transmit network and the server is absolutelysecure.

out-password can't be get by brute force attack, neither U-password.

Out-password can be stolen by the methods used to attack the passwordfor prior art; however, U-password is stored in secure media, therefore,the authentication can't be impersonate.

The significant improvements of claim 7

-   -   All methods used to attack the prior password can't make the        authentication impersonated.    -   the relation hardly breakable, therefore, authentication hardly        impersonated;    -   No need various strengthening methods, such as used in the prior        art.

The difference from prior art and significant improvements of claim 8

The most close related prior art is D5, the entity authentication basedon nonce, or challenge and response.

The background of this description (page 1 and page 11) and D6 describesthe significant improvements of the claim.

The difference between prior art and claim 8

For prior art: the authentication is protected only by one nonce. Thesame nonce must be transferred in challenge and response stage the noncecan be intercept, easily impersonated. But for claim 8, theauthentication is protected by three nonce; in challenge, transmitout-nonce; but in response stage, transmit in-nonce. U-nonce is keptsecret, keeping authentication nearly unbreakable.

The significant improvements of claim 8

The difficulties and the weakness problem can be easily solved by threenonce mechanism. Out-nonce is used in challenge stage; in-nonce is usedin response stage. Eve can intercept out-nonce, but it is useless inresponse stage, because without U-nonce, she has no way to know thein-nonce; keeping authentication nearly unbreakable.

This can also make reply attack useless.

The difference from prior art and significant improvements of claim 9.

The most close related to symmetric encryption in prior art D5, Thebackground of this description (page 1 and page 11) and D6 describes thesignificant improvements of the claim.

The difference between prior art and claim 9

For prior art, symmetric encryption, which uses only one key inencryption and decryption; because the same key must be transmitted,therefore, it can be intercepted by adversary. But for claim 8, theencryption is protected by three keys; out-key, in-key and U-key.

Out-key used for key distribution, it is a public key, no need to besecret; adversary can only intercept out-key and ciphered message, butcan't get in-key; because in-key is not transmit; in-key used in cipherand decipher, without in-key the ciphered message can't be decrypted.

The u-key is only need to be kept secret, it is a private key.

The significant improvements of claim 9

Three key mechanism has solved the key distribution problem of prior artby out-key transmission, making the ciphered data nearly unbreakable,much safer than prior art.

The key is one time key, i.e. key is only used once. But the prior artcan't.

The difference from prior art and significant improvements of claim 10.

The most close related to symmetric encryption in prior art D5, Thebackground of this description (page 1 and page 11) and D6 describes thesignificant improvements of the claim.

The difference between prior art and claim 10

For prior art, the most difficult problem for storing data by symmetricencryption, is how to store a big mount keys secure.

Claim 10 has solved the key storage problem by store out-key.

The significant improvements of claim 10

One most difficult problem is key storage problem, three key mechanismhas solved key storage problem, making the ciphered data nearlyunbreakable, much safer than prior art.

The difference and significant improvements of claim 11

The difference between prior art and claim 11-12

The most close related prior art is D5, the message digest only take themessage itself, only one item; assume s is a message, then h=hash(s) asthe digest of the message used in message authentication.

The difference of claim 11 is at least taking one item pair.

The significant improvements of claim 11-12.

The most close related prior art is D5, the hash function, the strengthis 2̂n, n is the hash length.

The significant improvements of claim 11-12 are the security strength ismuch bigger than 2̂n.

For example, the security strength of examples in page 14, is nearlyinfinite. This can make adversary no way to make false message to passas the original message.

The hash value of an item pair or cascaded hashed item pairs can be usedas the message digest, used in message authentication; also can be usedin preventing a sequence from being forged.

The security strength is very strong, assume MD5 128 bit hash used, forbrute force attack, adversary is very hard to get an image with lengthmuch more than 128 bits, even the image gotten, he or she has no way todecide what is the two items.

As used in transforming a pseudorandom sequence to a random sequence;the method above can extend the period of pseudorandom sequenceextraordinarily.

Even the period of pseudorandom sequence, the out sequence can't berepeated because the length of message is random, as a new periodbegins, it can't be the same length message as the first period begins.

Therefore the output sequence can be used as key source in cryptography.

The method of claim 11-12 can also be used in generating encryption key,nonce; and also for the security of U-password, U-key and U-nonce; andetc.

REFERENCES

-   -   [1] D1. CN 103329445 A, 25 Sep. 2013 (25.09.2013)    -   [2] D2. Shengyuan Wu, Object representing and processing method        and apparatus, U.S. Pat. No. 7,724,158, 2010    -   [3] D3. J. Glenn Brookshear, Computer Science: An Overview (11th        Edition), Pearson Higher Education, 2012    -   [4] D4. Shengyuan Wu, Introduction to Ubit Semantic Computing,        Proceedings of The 2014 International Conference on Semantic Web        and Web Services of Computer Science (SWW'14), 07, 2014    -   [5] D5. William Stallings, Cryptography and Network Security        principles and Practice, Fifth Edition, Pearson Education, Inc.,        2011    -   [6] D6. Shengyuan Wu, One-time Pad Cipher Based on Out-Key        Distribution, Proceedings of The 2014 International Conference        on Wireless Networks of Computer Science (ICW'14), 07, 2014

1. A binary 1 and 0 digital data processing method, the processingcomprising at least one of the following steps: 1) Scan a binary 1 and 0sequence from left to right, distinguishing the sequence into group stepby Right 0 rule as the following: Scanning a binary 1 and 0 sequencefrom left to right, if the first bit is 1, continue scanning until a bit0 is met, then from the first bit 1 to bit 0 is distinguished as agroup; if the first bit is 0, then the bit 0 is distinguished as agroup; continue scanning and distinguishing until the end of thesequence, if the last bit of the sequence is not 0, then the last groupis an incomplete group; The group above is characterized as: The leftbit neighbor of a group can't be 1, but the right bit neighbor of agroup can be 1 or 0, there is one and only one bit 0 in one group, ifthere are more than 1 bit in a group, then the bit 0 must be therightmost bit in the group; 2) Scan a binary 1 and 0 sequence from rightto left, distinguishing the sequence into group step by Right 0 rule asthe following: Scanning a binary 1 and 0 sequence from right to left, ifthe first bit is 1, continue scanning until a bit 0 is met, then fromthe first 1 to the right neighbor bit of the bit 0 is distinguished asan incomplete group; if the first bit is 0, continue scanning untilsecond bit 0 is met, then from the first 0 to the right neighbor bit ofthe second bit 0 is distinguished as a group; continue scanning anddistinguishing until the end of the sequence, The group above ischaracterized as: The left bit neighbor of a group can't be 1, but theright bit neighbor of a group can be 1 or 0, there is one and only onebit 0 in one group, if there are more than 1 bit in a group, then thebit 0 must be the rightmost bit in the group; 3) Scan a bit 1 and 0sequence from right to left, distinguishing the sequence into group stepby Left 0 rule as the following: Scanning a bit 1 and 0 sequence fromright to left, if the first bit is 1, continue scanning until a bit 0 ismet, then from the first 1 to the bit 0 is distinguished as a group; ifthe first bit is 0, the bit 0 is distinguished as a group; continuescanning and distinguishing until the end of the sequence, if the lastbit of the sequence is not 0, then the last group is an incompletegroup; The group above is characterized as: The right bit neighbor of agroup can't be 1, but the left bit neighbor of a group can be 1 or 0,there is one and only one bit 0 in one group, if there are more than 1bit in a group, then the bit 0 must be the leftmost bit in the group; 4)Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Left 0 rule as the following: Scanning abinary 1 and 0 sequence from left to right, if the first bit is 1,continue scanning until a bit 0 is met, then from the first 1 to theleft neighbor bit of the bit 0 is distinguished as an incomplete group;if the first bit is 0, continue scanning until next bit 0 is met, thenfrom the first 0 to the left neighbor of the next bit 0 is distinguishedas a group; continue scanning and distinguishing until the end of thesequence, The group above is characterized as: The right bit neighbor ofa group can't be 1, but the left bit neighbor of a group can be 1 or 0,there is one and only one bit 0 in one group, if there are more than 1bit in a group, then the bit 0 must be the leftmost bit in the group; 5)Scan a binary 1 and 0 sequence from left to right, distinguishing thesequence into group step by Right 1 rule as the following: Scanning abinary 1 and 0 sequence from left to right, if the first bit is 0,continue scanning until a bit 1 is met, then from the first bit 0 to bit1 is distinguished as a group; if the first bit is 1, then the bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence, if the last bit of the sequence is not 1, then thelast group is an incomplete group; The group above is characterized as:The left bit neighbor of a group can't be 0, but the right bit neighborof a group can be 1 or 0, there is one and only one bit 1 in one group,if there are more than 1 bit in a group, then the bit 1 must be therightmost bit in the group; 6) Scan a binary 1 and 0 sequence from rightto left, distinguishing the sequence into group step by Right 1 rule asthe following: Scanning a binary 1 and 0 sequence from right to left, ifthe first bit is 0, continue scanning until a bit 1 is met, then fromthe first 0 to the right neighbor bit of the bit 1 is distinguished asan incomplete group; if the first bit is 1, continue scanning until nextbit 1 is met, then from the first 1 to the right neighbor bit of thenext bit 1 is distinguished as a group; continue scanning anddistinguishing until the end of the sequence, The group above ischaracterized as: The left bit neighbor of a group can't be 0, but theright bit neighbor of a group can be 1 or 0, there is one and only onebit 1 in one group, if there are more than 1 bit in a group, then thebit 1 must be the rightmost bit in the group; 7) Scan a binary 1 and 0sequence from right to left, distinguishing the sequence into group stepby Left 1 rule as the following: Scanning a binary 1 and 0 sequence fromright to left, if the first bit is 0, continue scanning until a bit 1 ismet, then from the first 0 to the bit 1 is distinguished as a group; ifthe first bit is 1, the bit 1 is distinguished as a group; continuescanning and distinguishing until the end of the sequence, if the lastbit is not 1, then the last group is an incomplete group; The groupabove is characterized as: The right bit neighbor of a group can't be 0,but the left bit neighbor of a group can be 1 or 0, there is one andonly one bit 1 in one group, if there are more than 1 bit in a group,then the bit 1 must be the leftmost bit in the group; 8) Scan a binary 1and 0 sequence from left to right, distinguishing the sequence intogroup step by Left 1 rule as the following: Scanning a binary 1 and 0sequence from left to right, if the first bit is 0, continue scanninguntil a bit 1 is met, then from the first 0 to the left neighbor bit ofthe bit 1 is distinguished as an incomplete group; if the first bit is1, continue scanning until a bit 1 is met, then from the first 1 to theleft neighbor of the last bit 1 is distinguished as a group; continuescanning and distinguishing until the end of the sequence, The groupabove is characterized as: The right bit neighbor of a group can't be 0,but the left bit neighbor of a group can be 1 or 0, there is one andonly one bit 1 in one group, if there are more than 1 bit in a group,then the bit 1 must be the leftmost bit in the group; A complete groupdistinguished by the steps above is called as an Ubit frame, each bit inan Ubit frame is acted as Ubit; 9) Scan a binary 1 and 0 sequence fromleft to right, distinguishing the sequence into groups by Right 0 andRight 1 mixed rule as the following: Scanning a binary 1 and 0 sequencefrom left to right, if the first bit is 1, continue scanning until a bit0 is met, then from the first bit 1 to bit 0 is distinguished as agroup; if the first bit is 0, continue scanning until a bit 1 is met,then from the first bit 0 to bit 1 is distinguished as a group; continuescanning and distinguishing until the end of the sequence; The groupabove is characterized as: There is one and only one bit 0 or one bit 1in one group, and the bit number of one group must be greater than 1;10) Scan a bit 1 and 0 sequence from right to left, distinguishing thesequence into groups by Left 0 and left 1 mixed rule as the following:Scanning a bit 1 and 0 sequence from right to left, if the first bit is1, continue scanning until a bit 0 is met, then from the first 1 to thebit 0 is distinguished as a group; if the first bit is 0, continuescanning until a bit 1 is met, then from the first 0 to the bit 1 isdistinguished as a group; continue scanning and distinguishing until theend of the sequence; The group above is characterized as: There is oneand only one bit 0 or one bit 1 in one group, and the bit number of onegroup must be greater than
 1. 2. The method as defined in claim 1wherein further comprising at least one of the followingcharacteristics: 1) Distinguish a binary 1 and 0 sequence into groupsbased on a defined Uframe sequence outside the sequence, and therelation of the binary 1 and 0 sequence and the Uframe sequence alsodefined; 2) Distinguish a binary 1 and 0 segment sequence into groupsbased on a defined Uframe sequence inside the binary 1 and 0 sequence;3) Distinguish a binary 1 and 0 sequence into groups by Ucodes outsidethe sequence; 4) Distinguish a binary 1 and 0 sequence into groups byUcodes inside the sequence; 5) Change Uframe type by bitwise operation;6) Information embedded in or associated with Ucode.
 5. A binary 1 and 0digital data processing method, an object, there are multiple firstlevel attributions, and at least one first level attribution possessesmultiple second level attributions, but the object only relates to onebit group; the characteristic is the original bit group related to onesecond level attribution, add one or more new bit group related to othersecond level attribution, the processing further comprising at least oneof the following steps: 1) Get the object's first level attribution bythe corresponding relation between new and original bit group; 2) Getthe object's first level attribution by the relation between a new bitgroup and object's first level attribution.
 6. A binary 1 and 0 digitaldata processing method, the characteristic is the object is Chinesepolyphone character, the original bit group of polyphone character is GB2312 coded, and the new bit group part is connected with one end of theGB 2312 character part, each new bit group is 2 byte, and the leftmostbit of each byte is 1, wherein further comprising at least one step ofthe following steps: 1) Get the new bit group's grapheme by thecorresponding relation between new bit groups and the original bitgroups of the polyphone characters; 2) Get Pinyin Tone Code of acharacter according to the relation between Pinyin Tone Codes andoriginal codes or between Pinyin Tone Codes and new bit groups; 3) Getcharacter's Pinyin without tone representation according to the relationbetween its Pinyin Tone Code and Pinyin; 4) Get character's Pinyin withtone getting help from Pinyin Tone Code; 5) Get character's or word'sspeech according to the relation between Pinyin Tone Code and itspronunciation lib; 6) Input characters getting help from the relationbetween Pinyin Tone Code and Chinese character; 7) Compare two Chinesecharacter string by comparing its related Pinyin Tone Code string; 8)Sort Chinese characters by comparing its related Pinyin Tone Codestring; 9) Search Chinese character string getting help from therelation between Pinyin Tone Code and Chinese character; 10) Mixedobject inputting and processing getting help from the relation betweenPinyin Tone Code and Chinese character.
 7. A binary 1 and 0 digital dataprocessing method, characterized that entity authentication comprisingthree password, Party A is an verifier, Party B is a claimant, entityauthentication further comprising the following steps: (a) Party Bgenerates an in-password or ciphered in-password based on U-password andout-password; (b) Party B sends the in-password or ciphered in-passwordto party A; (c) Party A compare the in-password or ciphered in-passwordreceived from party B with the pre-stored in-password or pre-storedciphered in-password for party B; (d) Authenticated or failed accordingto the compared result.
 8. A binary 1 and 0 digital data processingmethod, the authentication based on challenge and response,characterized that authentication comprising three nonces, and twoparties share an U-nonce, Party A is an verifier, Party B is a claimant,entity authentication further comprising the following steps: (a) PartyA sends an out-nonce to party B, (b) Party B generates an in-nonce orciphered in-nonce based on the shared U-nonce and the out-nonce sentfrom Party A; and sends the in-nonce or ciphered in-nonce to party A;(c) Party A compare the in-nonce or ciphered in-nonce sent from party Bwith the in-nonce or ciphered in-nonce generated based on the sharedU-nonce and the out-nonce by itself; (d) Authenticated or failedaccording to the compared result.
 9. A binary 1 and 0 digital dataprocessing method, characterized that encryption and decryptioncomprising three keys; and two parties share a U-key; data encryptionand decryption further comprising the following steps: 1) Party Agenerates an in-key or ciphered in-key based on the shared U-key and anout-key; 2) Party A encrypts a message by the generated in-key orciphered in-key; 3) Party A sends the encrypted message and the relatedout-key to Party B; 4) Party B generates an in-key or ciphered in-keybased on the shared U-key and the out-key sent from Party A; 5) Party Bdecrypts the message with the in-key or ciphered in-key.
 10. A binary 1and 0 digital data processing method, characterized that data encryptionand decryption comprising three keys; storage data encryption anddecryption further comprising at least one of the following steps: 1)Encrypt step: a) Generates an in-key or ciphered in-key based on anU-key and an out-key; b) Encrypt a data by the in-key or cipheredin-key; c) Store encrypted data and the related out-key; 2) Decryptstep: a) Generates an in-key or ciphered in-key based on the U-key andthe stored out-key; b) Decrypt the encrypted data with the in-key orciphered in-key.
 11. A binary 1 and 0 digital data processing method,two binary 1 and 0 sequence, one is as an input: s, another as anoutput; output is used in message authentication or in preventing inputfrom being forged; s-1, s-2, . . . , s-n are sub-sequence of s, n>=1;transforming input into output characterized taking the followingsteps: 1) Select at least one item pair; 2) If the number of item pairselected more than 1; then cascaded the pairs; 3) Take hash operation ofeach cascaded item pair; 4) Take the result of step 3 as the output. 12.The method as defined in claim 11 further comprising at least one of thefollowing characteristics: 1) The item pairs selected at least one ismultilevel item pair; 2) As used in transforming a pseudorandomsequence: PS to a random sequence: RS, take the following steps: a) Takea NULL random sequence as RS; b) Take an input s with a random lengthfrom PS sequentially; c) Select n multilevel item pair; d) Take hashoperation for s as in claim 11; e) Cascade the result of step d) to RS;f) Loop back to step b) as needed more; g) Output RS.